Worst-Case-Optimal Dynamic Reinsurance for Large Claims
نویسندگان
چکیده
منابع مشابه
Optimal dynamic XL reinsurance
We consider a risk process modelled as a compound Poisson process. We find the optimal dynamic unlimited excess of loss reinsurance strategy to minimize infinite time ruin probability, and prove the existence of a smooth solution of the corresponding HamiltonJacobi-Bellman equation as well as a verification theorem. Numerical examples with exponential, shifted exponential, and Pareto claims are...
متن کاملRisk Bounds, Worst Case Dependence, and Optimal Claims and Contracts
Some classical results on risk bounds as the Fréchet bounds, the Hoeffding–Fréchet bounds and the extremal risk property of the comonotonicity dependence structure are used to describe worst case dependence structures for portfolios of real risks. An extension of the worst case dependence structure to portfolios of risk vectors is given. The bounds are used to (re-)derive and extend some result...
متن کاملWorst - Case - Optimal Anytime
Coalition formation is one of the key problems in mul-tiagent systems. One would prefer a coalition structure that maximizes the sum of the values of the coalitions , but often the number of coalition structures is too large to allow exhaustive search for the optimal one. This paper focuses on nding a worst case bound on how good the optimal coalition structure is compared to the best coalition...
متن کاملRobust Worst-case Optimal Investment
Based on a robustness concept adapted from mathematical statistics, we investigate robust optimal investment strategies for worst-case crash scenarios when the maximum crash height is not known a priori. We specify an efficiency criterion in terms of the certainty equivalents of optimal terminal wealth and explicitly solve the investor’s portfolio problem for crra risk preferences. We also stud...
متن کاملWorst-case Optimal Probability Updating
This paper discusses an alternative to conditioning that may be used when the prob-ability distribution is not fully specified. It does not require any assumptions (suchas CAR: coarsening at random) on the unknown distribution. The well-known MontyHall problem is the simplest scenario where neither naive conditioning nor the CARassumption suffice to determine an updated probabil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2012
ISSN: 1556-5068
DOI: 10.2139/ssrn.2032525